More skew-equienergetic digraphs
Authors
Abstract:
Two digraphs of same order are said to be skew-equienergetic if their skew energies are equal. One of the open problems proposed by Li and Lian was to construct non-cospectral skew-equienergetic digraphs on n vertices. Recently this problem was solved by Ramane et al. In this paper, we give some new methods to construct new skew-equienergetic digraphs.
similar resources
more skew-equienergetic digraphs
two digraphs of same order are said to be skew-equienergetic if theirskew energies are equal. one of the open problems proposed by li andlian was to construct non-cospectral skew-equienergetic digraphs onn vertices. recently this problem was solved by ramane et al. inthis paper, we give some new methods to construct new skew-equienergeticdigraphs.
full textskew equienergetic digraphs
let $d$ be a digraph with skew-adjacency matrix $s(d)$. the skew energy of $d$ is defined as the sum of the norms of all eigenvalues of $s(d)$. two digraphs are said to be skew equienergetic if their skew energies are equal. we establish an expression for the characteristic polynomial of the skew adjacency matrix of the join of two digraphs, and for the respective skew energ...
full textNew skew equienergetic oriented graphs
Let $S(G^{sigma})$ be the skew-adjacency matrix of the oriented graph $G^{sigma}$, which is obtained from a simple undirected graph $G$ by assigning an orientation $sigma$ to each of its edges. The skew energy of an oriented graph $G^{sigma}$ is defined as the sum of absolute values of all eigenvalues of $S(G^{sigma})$. Two oriented graphs are said to be skew equienergetic iftheir skew energies...
full textMore Equienergetic Signed Graphs
The energy of signed graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. Two signed graphs are said to be equienergetic if they have same energy. In the literature the construction of equienergetic signed graphs are reported. In this paper we obtain the characteristic polynomial and energy of the join of two signed graphs and thereby we give another construction ...
full textNew Skew Laplacian Energy of Simple Digraphs
For a simple digraph G of order n with vertex set {v1, v2, . . . , vn}, let d+i and d − i denote the out-degree and in-degree of a vertex vi in G, respectively. Let D (G) = diag(d+1 , d + 2 , . . . , d + n ) and D−(G) = diag(d1 , d − 2 , . . . , d − n ). In this paper we introduce S̃L(G) = D̃(G)−S(G) to be a new kind of skew Laplacian matrix of G, where D̃(G) = D+(G)−D−(G) and S(G) is the skew-adj...
full textnew skew laplacian energy of simple digraphs
for a simple digraph $g$ of order $n$ with vertex set${v_1,v_2,ldots, v_n}$, let $d_i^+$ and $d_i^-$ denote theout-degree and in-degree of a vertex $v_i$ in $g$, respectively. let$d^+(g)=diag(d_1^+,d_2^+,ldots,d_n^+)$ and$d^-(g)=diag(d_1^-,d_2^-,ldots,d_n^-)$. in this paper we introduce$widetilde{sl}(g)=widetilde{d}(g)-s(g)$ to be a new kind of skewlaplacian matrix of $g$, where $widetilde{d}(g...
full textMy Resources
Journal title
volume 1 issue 1
pages 57- 73
publication date 2016-08-10
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023